On Cardinality of Matrices Strongly Adequate for the Intuitionistic Propositional Logic
نویسنده
چکیده
Gödel [2] stated that there is no finite matrix adequate for the intuition-istic propositional logic (IN T). However, a denumerable adequate matrix was found by Ja´skowski [5]. In this paper it is shown that no denumerable matrix is strongly adequate for IN T which was previously conjectured by prof. R. Suszko. be the free algebra in the class of all algebras of the similarity type 2, 2, 2, 1 free-generated by a denumerably infinite set
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملA Short Note on Intuitionistic Propositional Logic with Multiple Conclusions
It is a common misconception among logicians to think that intuitionism is necessarily tied-up with single conclusion (sequent or Natural Deduction) calculi. Single conclusion calculi can be used and are convenient, but they are by no means necessary, as shown by such influential authors as Kleene, Takeuti and Dummett, to cite only three. If single conclusions are not necessary, how do we guara...
متن کاملCharacterization of strongly equivalent logic programs in intermediate logics
The non-classical, nonmonotonic inference relation associated with the answer set semantics for logic programs gives rise to a relationship of strong equivalence between logical programs that can be verified in 3-valued Gödel logic, G3, the strongest non-classical intermediate propositional logic (Lifschitz, Pearce and Valverde, 2001). In this paper we will show that KC (the logic obtained by a...
متن کاملOn Extensions and Variants of Dependence Logic — A study of intuitionistic connectives in the team semantics setting
Dependence logic is a new logic which incorporates the notion of “dependence”, as well as “independence” between variables into first-order logic. In this thesis, we study extensions and variants of dependence logic on the first-order, propositional and modal level. In particular, the role of intuitionistic connectives in this setting is emphasized. We obtain, among others, the following result...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کامل